Location:
Search - TSP in c
Search list
Description: 在Visual C++ 编译环境下，模拟退火算法程序，并利用它们求解了48个城市的TSP问题。-in Visual C compiler environment, simulated annealing procedures, and use them for the 48 cities in the TSP.
Platform: |
Size: 56340 |
Author: yuanhai |
Hits:
Description: 在Visual C++ 编译环境下，模拟退火算法程序，并利用它们求解了48个城市的TSP问题。-in Visual C compiler environment, simulated annealing procedures, and use them for the 48 cities in the TSP.
Platform: |
Size: 56320 |
Author: yuanhai |
Hits:
Description: 在Visual C++ 编译环境下，遗传算法的程序，并利用它们求解了48个城市的TSP问题-In the Visual C++ Compiler environment, the genetic algorithm procedure, and use them to solve a 48 cities TSP problem
Platform: |
Size: 727040 |
Author: liuwei |
Hits:
Description: 在Visual C++ 编译环境下，模拟退火算法程序，并利用它们求解了48个城市的TSP问题。-In the Visual C++ Compiler environment, the simulated annealing algorithm procedures and use them to solve a 48 cities TSP problem.
Platform: |
Size: 690176 |
Author: liuwei |
Hits:
Description: 在Visual C++ 编译环境下，遗传算法的程序，并利用它们求解了48个城市的TSP问题。-In the Visual C++ Compiler environment, the genetic algorithm procedure, and use them to solve a 48 cities TSP problem.
Platform: |
Size: 5897216 |
Author: 李志辉 |
Hits:
Description: Description
给定一个完全无向带权图G，其每一条边有一个非负的整数权值。目的是要找出G的一条经过每个顶点一次且仅经过一次的回路，使回路的总权值最小。
请设计一个2-近似算法，求出近似最小的总权值，即定义最优解为C，只要输出解在[C , 2 * C]的范围内都可以“Accept”。
Input
输入第一行为一个正整数n(1 <= n <= 20)，表示G中顶点的个数。接下来n行每行包括n个整数，第i行第j个的整数表示G中第i个点到第j个点的权值。
输入保证G[i,j] = G[j,i],且G[i,i] = 0.
Output
输出一个整数表示回路的近似最小权值C*。
第二行为n个顶点序号（从0开始标号）组成的与近似解相应的哈密顿回路。-Description given a weighted graph G, each edge has a non-negative integer weights. The objective is to find G, one through each vertex once and only after the last loop, the minimum value of the total weight of the loop. Please design a 2- approximation algorithm to find the approximate minimum total weight, that is to define the optimal solution C, as long as the output solution [C, 2* C] range of the " Accept" . Input The first acts of a positive integer n (1 < = n < = 20), the number of said G vertices. The next n lines each line contains n integers, the i-th row j th integer weights in G i-th point to the j th point. Input to ensure that G [i, j] = G [j, i], and G [i, i] = 0 Output Output an integer loop approximate minimum weight value C*. The second line is composed of n vertices and serial number (from 0 label) corresponding to the approximate solution of the Hamiltonian circuit.
Platform: |
Size: 1024 |
Author: liao |
Hits:
Description: tsp-c#
it s code of sequential of The Traveling Salesman Problem in c#.
Platform: |
Size: 66560 |
Author: atefeh |
Hits:
Description: TSP problem in C++, agente viajero
Platform: |
Size: 5120 |
Author: andrea_rat |
Hits:
Description: Graphical TSP genetic algorithm implementation with C# by mehdi akbari PhD student in QIAU Iran-Graphical TSP genetic algorithm implementation with C# by mehdi akbari PhD student in QIAU Iran
Platform: |
Size: 137216 |
Author: mehdi |
Hits:
Description: 一个简单的蚁群算法，是利用C#编写的，实现了TSP问题的求解-A simple ant colony algorithm, written in C# is to use to achieve the TSP problem solving
Platform: |
Size: 2048 |
Author: Louis |
Hits:
Description: matlab版本
图论中的旅行商问题TSP算法
一般C版本的比较多，这里提供matlab版本的，更简单方便使用
-Matlab code of TSP algorithm in graph theory
Platform: |
Size: 11264 |
Author: 赛博格 |
Hits:
Description: This TSP source code. (Travel sale problem). We were code by C#-This is TSP source code. (Travel sale problem). We were code by C#
Platform: |
Size: 22528 |
Author: tran |
Hits:
Description: 遗传算法（Genetic Algorithm）是模拟达尔文生物进化论的自然选择和遗传学机理的生物进化过程的计算模型，是一种通过模拟自然进化过程搜索最优解的方法
遗传算法的基本运算过程如下：
a)初始化：设置进化代数计数器t=0，设置最大进化代数T，随机生成M个个体作为初始群体P(0)。
b)个体评价：计算群体P(t)中各个个体的适应度。
c)选择运算:将选择算子作用于群体。选择的目的是把优化的个体直接遗传到下一代或通过配对交叉产生新的个体再遗传到下一代。选择操作是建立在群体中个体的适应度评估基础上的。
d)交叉运算：将交叉算子作用于群体。所谓交叉是指把两个父代个体的部分结构加以替换重组而生成新个体的操作。遗传算法中起核心作用的就是交叉算子。-Genetic algorithm (Genetic Algorithm) is a computational model of biological evolution of natural selection and genetic mechanism of biological evolution of the simulation of Darwin, is a kind of method to search the optimal solution by simulating natural evolutionary process
The basic operation process of genetic algorithm as follows:
A initialization settings): the evolution algebra counter t=0, set the maximum evolution algebra T, randomly generated M individuals as the initial population of P (0).
B) individual uation: Calculation of group P (T) in the fitness of each individual.
C) selecting operation: the selection operator acting on the group. The choice of the purpose is to direct individual genetic optimization to the next generation, or by paired crossover generates new individuals and then transmitted to the next generation. The choice of operation is based on individual fitness uation based on.
D) crossover: crossover operator acting on the group. The so-called cross
Platform: |
Size: 786432 |
Author: ahu_gj |
Hits:
Description: 运用蚁群算法求解TSP问题，蚁群算法十几年来研究比较热门的人工智能算法，应用在很多领域，如TSP、JSP等。-The use of ant colony algorithm to solve the TSP problem, ant colony algorithm for more than ten years of research and more popular artificial intelligence algorithms, applications in many fields, such as TSP, JSP, etc..
Platform: |
Size: 9216 |
Author: percy |
Hits:
Description: 这是我们课程学习用的遗传算法代码，用C语言写的，有关于函数优化的，也有关于TSP问题的，资料很好，与大家一起分享-This is our course to learn genetic algorithm code, written in C language, on the function optimization, but also on the TSP problem, the information is very good, to share with you
Platform: |
Size: 6077440 |
Author: 帅 |
Hits:
Description: 遗传算法解决TSP旅行商问题（可计算30个城市），用Visual C++编写，希望对大家有所帮助。-Genetic algorithm to solve TSP traveling salesman problem (calculate 30 cities), written in Visual C++, we want to help.
Platform: |
Size: 3072 |
Author: lala |
Hits:
Description: 解决TSP QAP问题的小程序,C＋＋编制,可以直接运行,详见程序-The small program to solve the problem of TSP QAP, c++ prepared, can be run directly, as shown in the program
Platform: |
Size: 2048 |
Author: jlrrct |
Hits:
Description: 解决TSP eil51问题的小程序,C＋＋编制,可以直接运行,详见程序(The small program to solve the problem of TSP eil51, c + + prepared, can be run directly, as shown in the program)
Platform: |
Size: 1533952 |
Author: Hayku
|
Hits:
Description: 解决TSP QAP问题的小程序,C＋＋编制,可以直接运行,详见程序(The small program to solve the problem of TSP QAP, c + + prepared, can be run directly, as shown in the program)
Platform: |
Size: 1024 |
Author: igs%5F246514
|
Hits:
Description: 解决TSP eil51问题的小程序,C＋＋编制,可以直接运行,详见程序(The small program to solve the problem of TSP eil51, c++ prepared, can be run directly, as shown in the program)
Platform: |
Size: 1534976 |
Author: kalucxd |
Hits: